An approximation to linear bounded phase coordinate control problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Bounded Facility Location Problems
The bounded k-median problem is to select in an undirected graph G = (V, E) a set S of k vertices such that the distance from any vertex v ∈ V to S is at most a given bound d and the average distance from vertices V\S to S is minimized. We present randomized algorithms for several versions of this problem and we prove some inapproximability results. We also study the bounded version of the unca...
متن کاملPhase Transitions of Bounded Satisfiability Problems
We introduce NL, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similarly as in Angluin’s popular L algorithm, which, however, learns deterministic finitestate automata (DFA). Like in a DFA, the states of an RFSA represent residual languages. Unlike a DFA, a...
متن کاملINTUITIONISTIC FUZZY BOUNDED LINEAR OPERATORS
The object of this paper is to introduce the notion of intuitionisticfuzzy continuous mappings and intuitionistic fuzzy bounded linear operatorsfrom one intuitionistic fuzzy n-normed linear space to another. Relation betweenintuitionistic fuzzy continuity and intuitionistic fuzzy bounded linearoperators are studied and some interesting results are obtained.
متن کاملLinear-Time Approximation Schemes for Clustering Problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our approach leads to simple randomized algorithms for the k-means, k-median and discrete k-means problems that yield (1 + ε) approximations with probability ≥ 1/2 and running times of O(2(k/ε)O(1)dn). These are the first algor...
متن کاملLinear-quadratic approximation of optimal policy problems
We consider a general class of nonlinear optimal policy problems involving forward-looking constraints (such as the Euler equations that are typically present as structural equations in DSGE models), and show that it is possible, under regularity conditions that are straightforward to check, to derive a problem with linear constraints and a quadratic objective that approximates the exact proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1966
ISSN: 0022-247X
DOI: 10.1016/0022-247x(66)90049-7